Symmetric Key Management: A new approach

نویسنده

  • Santosh Deshpande
چکیده

Many cryptographic algorithms (e.g., AES, HMAC) require the establishment of shared keying material in advance. The Federal key agreement schemes document is based on ANSI X9.42 agreement of symmetric keys using discrete logarithm cryptography, ANSI X9.44 key agreement and key transport using factoringbased cryptography and ANSI X9.63 key agreement and key transport using elliptic curve cryptography. It is necessary for the keying material to establish and maintain cryptographic keying relationships. Shared secret is a value computed using a prescribed algorithm and combination of keys belonging to the participants in the key establishment scheme. The public key algorithms like RSA are becoming the standards for the encryption. But the major threat of using RSA is, it is multiplicative and hence does not guarantees the uniqueness of the key and further it does not stand true to the dynamic demands of the system. Practically it is proved that such public key algorithms are slow as compared to the symmetric key algorithms. The PKI has provided a strong platform for the RSA algorithm. In view to overcome above limitations in this article a cryptographic method of key management has been proposed that uses the symmetric key algorithm (Blow fish) over the asymmetric key algorithm (RSA algorithms). The symmetric key algorithms do not have any key management scheme. Further, the proposed work uses ant colony based evolutionary computing algorithm to meet the requirement in which the shared secret value changes dynamically with time and matures with the time as numbers of communications amongst the legitimate users increases. The method proposed has been found have system of key management, which apart from being faster has all the security features. The efficiency in time management in all the aspects namely Key Generation, key Transmission, Key Revocation, Encryption and decryption is found to be much better than the widely used PKI. This speed do not compromise the security aspects of the system, in fact this efficient time management has helped to build up the secured transmission. Practically to avoid the time of encryption and decryption using the public key infrastructure certifying authorities use the session keys that use symmetric key algorithm. This method is not providing any authentication mechanism. The proposed system stands balanced and solves all the problems mentioned above. Overall it is a key management scheme for the symmetric key algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient symmetric polynomial-based key establishment protocol for wireless sensor networks

An essential requirement for providing secure services in wireless sensor networks is the ability to establish pairwise keys among sensors. Due to resource constraints on the sensors, the key establishment scheme should not create significant overhead. To date, several key establishment schemes have been proposed. Some of these have appropriate connectivity and resistance against key exposure, ...

متن کامل

Hybrid Key pre-distribution scheme for wireless sensor network based on combinatorial design

Key distribution is an important problem in wireless sensor networks where sensor nodesare randomly scattered in adversarial environments.Due to the random deployment of sensors, a list of keys must be pre-distributed to each sensor node before deployment. To establish a secure communication, two nodes must share common key from their key-rings. Otherwise, they can find a key- path in which ens...

متن کامل

Some results on the symmetric doubly stochastic inverse eigenvalue problem

‎The symmetric doubly stochastic inverse eigenvalue problem (hereafter SDIEP) is to determine the necessary and sufficient conditions for an $n$-tuple $sigma=(1,lambda_{2},lambda_{3},ldots,lambda_{n})in mathbb{R}^{n}$ with $|lambda_{i}|leq 1,~i=1,2,ldots,n$‎, ‎to be the spectrum of an $ntimes n$ symmetric doubly stochastic matrix $A$‎. ‎If there exists an $ntimes n$ symmetric doubly stochastic ...

متن کامل

An Online Threshold Key Distribution Scheme for Symmetric Key Management

The threshold secret sharing technique has been used extensively in cryptography. This technique is used for splitting secrets into shares and distributing the shares in the network to provide protection against attacks and to reduce the possibility of loss of information. In this paper, a new approach is introduced to enhance communication security among the nodes in a network based on the thr...

متن کامل

A Key Management Scheme for Mobile Wireless Sensor Networks

Symmetric encryption is the most commonly employed security solution in wireless sensor networks (WSNs). In this paper, a new approach that employs public-key cryptography during key establishment is proposed. In a WSN, the main issue for public-key cryptography is represented by communication and computational overheads. In order to reduce these requirements, a new authentication system based ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012